Management of Uncertainty in Combinatorial Game Theory

We describe a method to handle uncertainty in combinatorial game theory. This method has been implemented in Gogol, a general game playing system mainly applied to the game of Go. In complex games such as Go, a search intensive approach is intractable. Gogol uses a lot of knowledge and little search. This knowledge is represented using combinatorial game theory. We have adapted this theory to take into account the uncertainty due to the intractability of search in complex games. The system uses its evaluation of the game to choose a strategy. This strategy is applied by handling the uncertainty resulting from incomplete tree searches.